Order algebraizable logics
نویسندگان
چکیده
منابع مشابه
Combining Algebraizable Logics
The general methodology of “algebraizing” logics (cf. [2], [4]) is used here for combining different logics. The combination of logics is represented as taking the colimit of the constituent logics in the category of algebraizable logics. The cocompleteness of this category as well as its isomorphism to the corresponding category of certain first-order theories are proved. In this paper we tran...
متن کاملLöwenheim-Skolem theorems for non-classical first-order algebraizable logics
This paper is a contribution to the model theory of non-classical firstorder predicate logics. In a wide framework of first-order systems based on algebraizable logics, we study several notions of homomorphisms between models and find suitable definitions of elementary homomorphism, elementary substructure and elementary equivalence. Then we obtain (downward and upward) Löwenheim–Skolem theorem...
متن کاملCaicedo Implicit Connectives of Algebraizable Logics
An extensions by new axioms and rules of an algebraizable logic in the sense of Blok and Pigozzi is not necessarily algebraizable if it involves new connective symbols, or it may be algebraizable in an essentially different way than the original logic. However, extension whose axioms and rules define implicitly the new connectives are algebraizable, via the same equivalence formulas and definin...
متن کاملA Henkin-Style Proof of Completeness for First-order Algebraizable Logics
This paper considers Henkin’s proof of completeness of classical first-order logic and extends its scope to the realm of algebraizable logics in the sense of Blok and Pigozzi. Given a propositional logic L (for which we only need to assume that it has an algebraic semantics L and a suitable disjunction) we axiomatize two natural firstorder extensions L∀ and L∀ and prove that the former is compl...
متن کاملOn semilattice-based logics with an algebraizable assertional companion
This paper studies some properties of the so-called semilattice-based logics (which are defined in a standard way using only the order relation from a variety of algebras that have a semilattice reduct with maximum) under the assumption that its companion assertional logic (defined from the same variety of algebras using the top element as representing truth) is algebraizable. This describes a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2013
ISSN: 0168-0072
DOI: 10.1016/j.apal.2012.10.013